Model Checking with Strong Fairness

Model Checking with Strong Fairness

In this paper we present a coherent framework for symbolic model checking of linear time tem poral logic ltl properties over nite state reactive systems taking full fairness constraints into consideration We use the computational model of a fair discrete system fds which takes into account both justice weak fairness and compassion strong fairness The approach presented here reduces the model ch...

Coping With Strong Fairness

We consider the veriication of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak and strong fairness constraints. Allowing the transitions to have weak or strong fairness constraints simpliies the modeling of systems in many cases. We use the automata theoretic approach to model checking. To cope with the strong fairness constraints eeciently we empl...

PressCoping With Strong Fairness

LTL Model Checking under Fairness in ProB

Model checking of liveness properties often results in unrealistic, unfair infinite behaviors as counterexamples. Fairness is a notion where the search is constrained to infinite paths that do not ignore infinitely the execution of a set of enabled actions. In this work we present an implementation for efficient checking of LTL formulas under strong and weak fairness in ProB, available for mode...

Model Checking LTLR Formulas under Localized Fairness

Many temporal logic properties of interest involve both state and action predicates and only hold under suitable fairness assumptions. Temporal logics supporting both state and action predicates such as the Temporal Logic of Rewriting (TLR) can be used to express both the desired properties and the fairness assumptions. However, model checking such properties directly can easily become impossib...